Finite Disjunctive Programming Methods for General mixed Integer linear Programs
نویسنده
چکیده
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 CHAPTER
منابع مشابه
A Computational Study of Finitely Convergent Polyhedral Methods for General Mixed-Integer Linear Programs
Recently, Chen et al. (2009) proposed a finite polyhedral characterization of the convex hull of solutions to general mixed integer linear programs with bounded integer variables and introduced finitely convergent algorithms to solve this class of problems. In this paper, we investigate whether these algorithms provide computational tools that go beyond the convergence results reported in the a...
متن کاملFinite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We propose a finitely convergent convex hull tree algorithm which constructs a linear program that has the same optimal solution as the associated MILP. In addition, we combine the standard notion of sequential cutting planes...
متن کاملLift-and-project for general two-term disjunctions
In this paper we generalize the cut strengthening method of Balas and Perregaard for 0/1 mixed-integer programming to disjunctive programs with general two-term disjunctions. We apply our results to linear programs with complementarity constraints.
متن کاملAncestral Benders’ Cuts and Multi-term Disjunctions for Mixed-Integer Recourse Decisions in Stochastic Programming
This paper focuses on solving two-stage stochastic mixed integer programs (SMIPs) with general mixed integer decision variables in both stages. We develop a decomposition algorithm in which the first stage approximation is solved using a branch-and-bound tree with nodes inheriting Benders’ cuts that are valid for their ancestor nodes. In addition, we develop two closely related convexification ...
متن کاملA computational study of the cutting plane tree algorithm for general mixed-integer linear programs
The cutting plane tree (CPT) algorithm provides a finite disjunctive programming procedure to obtain the solution of general mixed-integer linear programs (MILP) with bounded integer variables. In this paper, we present our computational experience with variants of the CPT algorithm. Because the CPT algorithm is based on discovering multi-term disjunctions, this paper is the first to present co...
متن کامل